منابع مشابه
On Some Decompositions of r-Disjunctive Languages
Some kinds of decompositions of r-disjunctive languages on an arbitrary alphabet will be investigated. We will show that an f-disjunctive (t-disjunctive) language can be divided into two parts and either one part of them is an f-disjunctive (t-disjunctive) language or both parts are r-disjunctive but not f-disjunctive (t-disjunctive) languages. Finally, a relevant result of H. J. Shyr and S. S....
متن کاملLanguages and monoids with disjunctive identity.dvi
We show that the syntactic monoids of insertion-closed, deletionclosed and dipolar-closed languages are the groups. If the languages are insertionclosed and congruence simple, then their syntactic monoids are the monoids with disjunctive identity. We conclude with some properties of dipolarclosed languages.
متن کاملSharp Disjunctive Decomposition for Language Emptiness Checking
We propose a “Sharp” disjunctive decomposition approach for language emptiness checking, which is specifically targeted at “Large” or “Difficult” problems. Based on the SCC (Strongly-Connected Component) quotient graph of the property automaton, our method partitions the entire state space so that each state subspace accepts a subset of the language, the union of which is exactly the language a...
متن کاملShuffle Decomposition of Regular Languages
Let A ⊆ X∗ be a regular language. In the paper, we will provide an algorithm to decide whether there exist a nontrivial language B ∈ I(n, X) and a nontrivial regular language C ⊆ X∗ such that A = B C
متن کاملA Summary and Illustration of Disjunctive Decomposition with Set Convexification
In this paper we review the Disjunctive Decomposition (D) algorithm for two-stage Stochastic Mixed Integer Programs (SMIP). This novel method uses the principles of disjunctive programming to develop cuttingplane-based approximations of the feasible set of the second stage problem. At the core of this approach is the Common Cut Coefficient Theorem, which provides a mechanism for transforming cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1986
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90020-4